Search on vertex-transitive graphs by lackadaisical quantum walk
نویسندگان
چکیده
منابع مشابه
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph’s vertices, this is the problem of determining a local minimum of f—a vertex v for which f(v) is no more than f evaluated at any of v’s neighbors. In 1983, Aldous gave the first strong lower bounds for the problem, showing that any randomized algorithm requires Ω(2n/2−o(1)) queries to determin...
متن کاملVertex-transitive CIS graphs
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...
متن کاملOn Isomorphisms of Vertex-transitive Graphs
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study...
متن کاملOn the topology of vertex-transitive graphs
The undirected graphs atoms were introduced independently Mader[21] and Watkins [28] in order to show that the connectivity of a connected undirected vertex-transitive is large. The directed graphs atoms were introduced by Chaty in [3]. The author obtained a structure Theorem for the atoms in the last case [9], showing that the connectivity of a connected vertex-transitive directed is large. Th...
متن کاملOn a Conjecture concerning Vertex-transitive Graphs
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture, which would imply the Lovasz conjecture and give an interesting insight on the symmetry of vertex-transitive graphs, if true. Though it could become an approach ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2020
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-020-02841-z